Tree Kernel-based Relation Extraction with Various Entity-Related Features
نویسندگان
چکیده
This paper proposes a convolution tree kernel-based approach for relation extraction where parse trees are expanded with various entity-related features, such as entity type, subtype, and mention level. Our study indicates that not only can our method effectively capture both syntactic structure and entity information of relation instances in a single tree kernel, but also can avoid the difficulty with tuning the parameters in composite kernels. Moreover, we apply several linguistic rules to further prune out noisy information from the parse trees representing relation instances. Empirical evaluation on the ACE 2004 benchmark corpus shows that our system works well and achieves promising performance compared with other kernel-based systems.
منابع مشابه
A Composite Kernel to Extract Relations between Entities with Both Flat and Structured Features
This paper proposes a novel composite kernel for relation extraction. The composite kernel consists of two individual kernels: an entity kernel that allows for entity-related features and a convolution parse tree kernel that models syntactic information of relation examples. The motivation of our method is to fully utilize the nice properties of kernel methods to explore diverse knowledge for r...
متن کاملRelation Extraction Using Convolution Tree Kernel Expanded with Entity Features
This paper proposes a convolution tree kernel-based approach for relation extraction where the parse tree is expanded with entity features such as entity type, subtype, and mention level etc. Our study indicates that not only can our method effectively capture both syntactic structure and entity information of relation instances, but also can avoid the difficulty with tuning the parameters in c...
متن کاملExploiting Constituent Dependencies for Tree Kernel-Based Semantic Relation Extraction
This paper proposes a new approach to dynamically determine the tree span for tree kernel-based semantic relation extraction. It exploits constituent dependencies to keep the nodes and their head children along the path connecting the two entities, while removing the noisy information from the syntactic parse tree, eventually leading to a dynamic syntactic parse tree. This paper also explores e...
متن کاملA Composite Kernel to Extract Relations with both Flat and Structured Features
This paper proposes a novel composite kernel for relation extraction. The composite kernel consists of two individual kernels: an entity kernel that allows for entity-related features and a convolution parse tree kernel that models syntactic information of relation examples. The motivation of our method is to fully utilize the nice properties of kernel methods to explore and combine diverse fea...
متن کاملA Feature-Enriched Tree Kernel for Relation Extraction
Tree kernel is an effective technique for relation extraction. However, the traditional syntactic tree representation is often too coarse or ambiguous to accurately capture the semantic relation information between two entities. In this paper, we propose a new tree kernel, called feature-enriched tree kernel (FTK), which can enhance the traditional tree kernel by: 1) refining the syntactic tree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Chinese Language and Computing
دوره 17 شماره
صفحات -
تاریخ انتشار 2007